From 1D Convolutional Codes to 2D Convolutional Codes of Rate 1/n
نویسندگان
چکیده
In this paper we introduce a new type of superregular matrices that give rise to novel constructions of two-dimensional (2D) convolutional codes with finite support. These codes are of rate 1/n and degree δ with n ≥ δ + 1 and achieve the maximum possible distance among all 2D convolutional codes with finite support with the same parameters.
منابع مشابه
BLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملDecoding of 2D convolutional codes over an erasure channel
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...
متن کاملChapter 11 Burst Erasure Correction of 2 D convolutional codes ∗
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. In particular, we present a procedure to recover bursts of erasures that are distributed in a diagonal line. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main...
متن کاملConvolutional Codes Over Rings
Convolutional codes over rings behave quite differently from convolutional codes over fields, but they are the ones best suited for phase modulation. This behavior depends strongly on the structure of the underlying ring. Some basic concepts about ring convolutional codes, in particular over Zpr , and their structural properties such as basicity, systematicity, non-catastrophicity and minimalit...
متن کاملA construction of MDS 2D convolutional codes of rate 1/n based on superregular matrices
In this paper two-dimensional convolutional codes with finite support are considered, i.e., convolutional codes whose codewords have compact support indexed in N and take values in F, where F is a finite field. The main goal of this work is to analyze the (free) distance properties of this type of codes of rate 1/n and degree δ. We first establish an upper bound on the maximum possible distance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014